More Efficient On-the-Fly Verification Methods of Colored Petri Nets

Towards an Efficient Structural Analysis of Colored Petri Nets

This paper presents the Backward reachability which is a structural analysis method applicable to Colored Petri Nets (CPN). This method avoids the fastidious computation of simulation and the combinatorial explosion of reachable state space. The backward reachability provides the information about different ways of reaching a particular CPN marking. This evaluation considers the evolution of ma...

A Note on Colored Petri Nets

Towards Reusable Colored Petri Nets

Reuse has long been recognized as a key technology that can bring about signi cant productivity gains in software development. Code-level reuse is wellunderstood and frequently practiced. However, reuse in software requirements, another phase where much bene t can be expected, remains inadequately addressed. Hierarchical Colored Petri Net (HCPN) formalism has been successfully used on several l...

Extended Simple Colored Petri Nets

We present a new class of Petri Nets, called Extended Simple Colored Petri Nets (ESCP-nets), which are essentially Simple Colored Petri Nets (SCP-nets) with three added features: first, there is a built-in type of real numbers; second, tokens can be forced to wait in places; third, an interface specifies how the Net can be externally supervised. Even if these added features also add complexity,...

Timed Colored Petri Nets Based

Abstract: Aero-engines maintenance procedure can be treated as a typical discrete event dynamic system. A theory that synthesized timed colored Petri net is proposed. The theory adopts a bottom-up approach by merging all sub modules, and each one characterizes the critical resource contention among processes. Nevertheless Petri net seems inapplicable to dynamic scheduling modelling because of i...